全文获取类型
收费全文 | 5258篇 |
免费 | 428篇 |
国内免费 | 342篇 |
专业分类
化学 | 208篇 |
晶体学 | 2篇 |
力学 | 31篇 |
综合类 | 141篇 |
数学 | 5385篇 |
物理学 | 261篇 |
出版年
2024年 | 10篇 |
2023年 | 99篇 |
2022年 | 145篇 |
2021年 | 123篇 |
2020年 | 205篇 |
2019年 | 234篇 |
2018年 | 226篇 |
2017年 | 202篇 |
2016年 | 128篇 |
2015年 | 95篇 |
2014年 | 180篇 |
2013年 | 457篇 |
2012年 | 197篇 |
2011年 | 309篇 |
2010年 | 305篇 |
2009年 | 455篇 |
2008年 | 401篇 |
2007年 | 285篇 |
2006年 | 332篇 |
2005年 | 227篇 |
2004年 | 207篇 |
2003年 | 177篇 |
2002年 | 171篇 |
2001年 | 153篇 |
2000年 | 108篇 |
1999年 | 101篇 |
1998年 | 93篇 |
1997年 | 66篇 |
1996年 | 46篇 |
1995年 | 53篇 |
1994年 | 44篇 |
1993年 | 27篇 |
1992年 | 26篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6028条查询结果,搜索用时 218 毫秒
81.
82.
83.
We show that a k‐edge‐connected graph on n vertices has at least spanning trees. This bound is tight if k is even and the extremal graph is the n‐cycle with edge multiplicities . For k odd, however, there is a lower bound , where . Specifically, and . Not surprisingly, c3 is smaller than the corresponding number for 4‐edge‐connected graphs. Examples show that . However, we have no examples of 5‐edge‐connected graphs with fewer spanning trees than the n‐cycle with all edge multiplicities (except one) equal to 3, which is almost 6‐regular. We have no examples of 5‐regular 5‐edge‐connected graphs with fewer than spanning trees, which is more than the corresponding number for 6‐regular 6‐edge‐connected graphs. The analogous surprising phenomenon occurs for each higher odd edge connectivity and regularity. 相似文献
84.
Irena Penev 《Journal of Graph Theory》2017,84(1):57-92
A class of graphs is hereditary if it is closed under isomorphism and induced subgraphs. A class of graphs is χ‐bounded if there exists a function such that for all graphs , and all induced subgraphs H of G, we have that . We prove that proper homogeneous sets, clique‐cutsets, and amalgams together preserve χ‐boundedness. More precisely, we show that if and are hereditary classes of graphs such that is χ‐bounded, and such that every graph in either belongs to or admits a proper homogeneous set, a clique‐cutset, or an amalgam, then the class is χ‐bounded. This generalizes a result of [J Combin Theory Ser B 103(5) (2013), 567–586], which states that proper homogeneous sets and clique‐cutsets together preserve χ‐boundedness, as well as a result of [European J Combin 33(4) (2012), 679–683], which states that 1‐joins preserve χ‐boundedness. The house is the complement of the four‐edge path. As an application of our result and of the decomposition theorem for “cap‐free” graphs from [J Graph Theory 30(4) (1999), 289–308], we obtain that if G is a graph that does not contain any subdivision of the house as an induced subgraph, then . 相似文献
85.
John Engbers 《Journal of Graph Theory》2017,85(4):780-787
For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than . 相似文献
86.
Barnaby Roberts 《Journal of Graph Theory》2017,85(2):429-445
We look at several saturation problems in complete balanced blow‐ups of graphs. We let denote the blow‐up of H onto parts of size n and refer to a copy of H in as partite if it has one vertex in each part of . We then ask how few edges a subgraph G of can have such that G has no partite copy of H but such that the addition of any new edge from creates a partite H. When H is a triangle this value was determined by Ferrara, Jacobson, Pfender, and Wenger in 5 . Our main result is to calculate this value for when n is large. We also give exact results for paths and stars and show that for 2‐connected graphs the answer is linear in n whilst for graphs that are not 2‐connected the answer is quadratic in n. We also investigate a similar problem where G is permitted to contain partite copies of H but we require that the addition of any new edge from creates an extra partite copy of H. This problem turns out to be much simpler and we attain exact answers for all cliques and trees. 相似文献
87.
For any graph G, let be the number of spanning trees of G, be the line graph of G, and for any nonnegative integer r, be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e. In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k. Thus we prove a conjecture on for such a graph G. 相似文献
88.
Gábor Wiener 《Journal of Graph Theory》2017,84(4):443-459
The minimum leaf number ml(G) of a connected graph G is defined as the minimum number of leaves of the spanning trees of G if G is not hamiltonian and 1 if G is hamiltonian. We study nonhamiltonian graphs with the property for each or for each . These graphs will be called ‐leaf‐critical and l‐leaf‐stable, respectively. It is far from obvious whether such graphs exist; for example, the existence of 3‐leaf‐critical graphs (that turn out to be the so‐called hypotraceable graphs) was an open problem until 1975. We show that l‐leaf‐stable and l‐leaf‐critical graphs exist for every integer , moreover for n sufficiently large, planar l‐leaf‐stable and l‐leaf‐critical graphs exist on n vertices. We also characterize 2‐fragments of leaf‐critical graphs generalizing a lemma of Thomassen. As an application of some of the leaf‐critical graphs constructed, we settle an open problem of Gargano et al. concerning spanning spiders. We also explore connections with a family of graphs introduced by Grünbaum in correspondence with the problem of finding graphs without concurrent longest paths. 相似文献
89.
We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on structural decomposition theorems. Given a poset with large dimension but bounded height, we directly find a large clique subdivision in its cover graph. Therefore, our proof is accessible to readers not familiar with topological graph theory, and it allows us to provide explicit upper bounds on the dimension. With the introduced tools we show a second result that is supporting a conjectured generalization of the previous result. We prove that ‐free posets whose cover graphs exclude a fixed graph as a topological minor contain only standard examples of size bounded in terms of k. 相似文献
90.
We find a formula for the number of directed 5‐cycles in a tournament in terms of its edge scores and use the formula to find upper and lower bounds on the number of 5‐cycles in any n‐tournament. In particular, we show that the maximum number of 5‐cycles is asymptotically equal to , the expected number 5‐cycles in a random tournament (), with equality (up to order of magnitude) for almost all tournaments. 相似文献